﻿//https://leetcode.cn/problems/longest-continuous-increasing-subsequence/

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums)
    {
        int n = nums.size();
        int ret = 0;
        for (int i = 0; i < n;)
        {
            int j = i + 1;
            while (j<n && nums[j]>nums[j - 1]) j++;
            ret = max(ret, j - i);

            i = j;
        }

        return ret;

    }
};